Efficient Dense Gaussian Elimination over the Finite Field with Two Elements

نویسندگان

  • Martin R. Albrecht
  • Gregory V. Bard
  • Clément Pernet
چکیده

In this work we describe an efficient implementation of a hierarchy of algorithms for Gaussian elimination upon dense matrices over the field with two elements (F2). We discuss both wellknown and new algorithms as well as our implementations in the M4RI library, which has been adopted into SAGE. The focus of our discussion is a block iterative algorithm for PLE decomposition which is inspired by the M4RI algorithm. The implementation presented in this work provides considerable performance gains in practice when compared to the previously fastest implementation. We provide performance figures on x86 64 CPUs to demonstrate the alacrity of our approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Communication-efficient parallel generic pairwise elimination

The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. In this paper, we consider the parallel complexity of generic pairwise elimination, special cases of which include Gaussian elimination with pairwise pivoting, Gaussian elimination over a finite field, generic Neville elimination and Givens reduction. We develop a new block-re...

متن کامل

Computing the Rank of Large Sparse Matrices over Finite Fields

We want to achieve efficient exact computations, such as the rank, of sparse matrices over finite fields. We therefore compare the practical behaviors, on a wide range of sparse matrices of the deterministic Gaussian elimination technique, using reordering heuristics, with the probabilistic, blackbox, Wiedemann algorithm. Indeed, we prove here that the latter is the fastest iterative variant of...

متن کامل

Generalized Gaussian Quadrature Rules for Discontinuities and Crack Singularities in the Extended Finite Element Method

New Gaussian integration schemes are presented for the efficient and accurate evaluation of weak form integrals in the extended finite element method. For discontinuous functions, we construct Gauss-like quadrature rules over arbitrarily-shaped elements in two dimensions without the need for partitioning the finite element. A point elimination algorithm is used in the construction of the quadra...

متن کامل

Analysis of Axisymmetric and Non-Axisymmetric Stretching of Sheet Metals by the Finite Element Method

Stretching process of sheet metals in both cases of axisymmetric and non-axisymmetric is analyzed. A rigid-plastic, normal anisotrop material is assumed and large strain formulation is applied. Triangular elements are used and stiffness equations of elements are obtained from virtual work principle. These nonlinear equations are linearized by Newton-Raphsons method and are solved by Gaussian el...

متن کامل

Recursion based parallelization of exact dense linear algebra routines for Gaussian elimination

We present block algorithms and their implementation for the parallelization of sub-cubic Gaussian elimination on shared memory architectures. Contrarily to the classical cubic algorithms in parallel numerical linear algebra, we focus here on recursive algorithms and coarse grain parallelization. Indeed, sub-cubic matrix arithmetic can only be achieved through recursive algorithms making coarse...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1111.6549  شماره 

صفحات  -

تاریخ انتشار 2011